SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks
نویسندگان
چکیده
Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries. This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches. Our solution offers all the benefits needed for practical use-cases, including excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic road networks, i.e., edge weights changing frequently due to traffic updates. The proposed SALT framework is a deployable software solution capturing a range of network-related query problems under one “algorithmic hood”.
منابع مشابه
Fast Exact Computation for all shortest-path query variants on road networks
We study the problem of computing isochrones in static and dynamic road networks, where the objective is to identify the boundary of the region in range from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e. g., urban planning, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fa...
متن کاملDistance Landmarks Revisited for Road Graphs
Computing shortest distances is one of the fundamental problems on graphs, and remains a challenging task today. Distance landmarks have been recently studied for shortest distance queries with an auxiliary data structure, referred to as landmark covers. This paper studies how to apply distance landmarks for fast exact shortest distance query answering on large road graphs. However, the direct ...
متن کاملShortest Path and Distance Queries on Road Networks: An Experimental Evaluation
Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The stateof-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importancebased approaches. The two categories of techniques, however, have not been compa...
متن کاملEngineering Time-dependent One-To-All Computation
Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cacheefficient, but only on static road networks. We show how to augment it to the time-dependent scenario. The advantage if the new approach is that it settles nodes, even for a profile query, by scanning all downward edges. We improve the scanning of the downwa...
متن کاملEffective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks
In a constrained shortest path (CSP) query, each edge in the road network is associated with both a length and a cost. Given an origin s, a destination t, and a cost constraint θ, the goal is to find the shortest path from s to t whose total cost does not exceed θ. Because exact CSP is NP-hard, previous work mostly focuses on approximate solutions. Even so, existing methods are still prohibitiv...
متن کامل